Construction of Linear Codes over Rings Zm Correcting Double ±1 or ±2 Errors

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Linear Codes over Finite Rings

Linear codes over finite rings with identity have recently raised a great interest for their new role in algebraic coding theory and for their successful application in combined coding and modulation. Thus, in this paper we address the problems of constructing of new cyclic, BCH, alternant, Goppa and Srivastava codes over local finite commutative rings with identity. These constructions are ver...

متن کامل

Linear representations of convolutional codes over rings

In this paper we extend the relation between convolutional codes and linear systems over finite fields to certain commutative rings through first order representations . We introduce the definition of rings with representations as those for which these representations always exist, and we show that finite products of finite fields belong to this class. We develop the input/state/output represen...

متن کامل

Linear Codes over Finite Chain Rings

The aim of this paper is to develop a theory of linear codes over finite chain rings from a geometric viewpoint. Generalizing a well-known result for linear codes over fields, we prove that there exists a one-to-one correspondence between so-called fat linear codes over chain rings and multisets of points in projective Hjelmslev geometries, in the sense that semilinearly isomorphic codes corres...

متن کامل

Correcting Errors in Linear Codes with Neural Network

In this paper we develop an error-correcthg algorithm in the framework of neural networks. We consider tbe problem of detecting and correcting of a linear code which is assumed to have at most one error. keyword Neural networks, error detection, error correction, check matrix, linear code.

متن کامل

On Linear Codes Correcting Random and Low-Denslty Burst Errors

This paper presents lower and upper bounds on the number of parity-check digits required for a linear code that corrects random errors and errors which are in the form of low-density bursts.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematical Problems of Computer Science

سال: 2018

ISSN: 2579-2784

DOI: 10.51408/1963-0008